Finding cycles in hierarchical hypercube networks

a r t i c l e i n f o a b s t r a c t The hierarchical hypercube network, which was proposed as an alternative to the hypercube, is suitable for building a large-scale multiprocessor system. A bipartite graph G = (V , E) is bipancyclic if it contains cycles of all even lengths ranging from 4 to |V |. In this paper, we show that the hierarchical hypercube network is bipancyclic.